On customer flows in jackson queueing networks
نویسندگان
چکیده
منابع مشابه
Stability of Jackson-type Queueing Networks, I
This paper gives a pathwise construction of Jackson-type queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is made precise in the paper. The main tools...
متن کاملPerfect sampling of Jackson queueing networks
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the efficiency of sampling from their exact stationary distribution. We show that perfect sampling is possible, although the underlying Markov chain may have an infinite state space. The main idea is to use a Jackson network with infinite buffers (that has a product form stationary distribution) to b...
متن کاملPEPA Queues: Capturing Customer Behaviour in Queueing Networks
Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. We present the PEPA Queues formalism, which uses the popular stochastic process algebra PEPA to represent the individual state and behaviour of customers and servers. We offer a formal semantics for PEPA Queues, plus a...
متن کاملQueueing in Traffic Flows
This project studies the effects of vehicle routing on pollution levels. We aim to develop queueing theory based mathematical models to analyse highway traffic flows and focus on focus on the capacity drop and shockwaves. Then we intend to use emission models and plume model to predict air pollution in a wider region. These predictions will be tested using remote sensing data and data from meas...
متن کاملDiffusion Parameters of Flows in Stable Queueing Networks
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes the system stable. An example is a generalized Jackson network with load less than unity and any work conserving policy. We find a simple diffusion limit for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2010
ISSN: 0001-8678,1475-6064
DOI: 10.1239/aap/1293113152